Regular graph - PDFSEARCH.IO - Document Search Engine

Regular graph
Results: 157

#	Item
91	DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2014-05-27 07:51:07 Symmetric graph Petersen graph Covering graph Voltage graph Orbifold Graph theory Algebraic graph theory Graph
92	FOUR-COLORING SIX-REGULAR GRAPHS ON THE TORUS KAREN L. COLLINS AND JOAN P. HUTCHINSON Dedicated to Herbert S. Wilf in honor of his 65th birthday, and to Phyllis Cassidy in honor of her retirement from Smith College. Add to Reading List Source URL: kcollins.web.wesleyan.edu Language: English - Date: 2000-08-14 13:08:22 Graph Neighbourhood Edge coloring Graph theory Graph coloring Planar graph
93	Microsoft Word - KJ--ESWC2007-final.doc Add to Reading List Source URL: www.ag-nbi.de Language: English - Date: 2007-03-24 10:40:58 Regular expressions Pattern matching Automata theory Path expression Path Graph theory Mathematics Theoretical computer science
94	DOC Document Add to Reading List Source URL: web.math.princeton.edu Language: English - Date: 2001-07-17 21:14:42 Adjacency matrix Bipartite graph Regular graph Graph Ramanujan graph Random graph Bipartite double cover Signed graph Graph theory Mathematics Algebraic graph theory
95	Graph Operations and Laplacian Eigenpolytopes A. Padrol-Sureda? and J. Pfeifle?? Departament de Matem`atica Aplicada II, Universitat Polit`ecnica de Catalunya C/Jordi Girona, 1-3, 08034 Barcelona {arnau.padrol,julian.pfe Add to Reading List Source URL: upcommons.upc.edu Language: English - Date: 2013-10-09 06:52:48 Algebraic graph theory Polytopes Graph operations Connectivity Line graph Laplacian matrix Regular graph Adjacency matrix Convex polytope Graph theory Mathematics Algebra
96	Models of random regular graphs N. C. Wormald Summary This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related result Add to Reading List Source URL: www.math.uwaterloo.ca Language: English - Date: 2008-07-29 17:48:11 Pseudoforest Graph Adjacency matrix Cubic graph Erdős–Rényi model Watts and Strogatz model Graph theory Random graphs Random regular graph
97	APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department of Computer Science University of Arizona Tucson, AZ 85721 Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2006-03-21 10:39:03 Models of computation Mathematics Symbol Nondeterministic finite automaton Formal languages Cycle rank Ε-quadratic form Graph theory Theoretical computer science Automata theory
98	IEICE TRANS. ??, VOL.Exx–??, NO.xx XXXX 200x 1 PAPER Special Section on Machine Vision and its Applications Add to Reading List Source URL: mi.eng.cam.ac.uk Language: English - Date: 2012-05-25 14:55:20 Algebraic graph theory Image processing Adjacency matrix Matrices Segmentation Matrix Random walk Topology Regular graph Graph theory Mathematics Algebra
99	Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inaba1 and Haruo Hosoya1 The University of Tokyo, {kinaba,hahosoya}@is.s.u-tokyo.ac.jp Abstract. An n-ary query over trees takes an input tree t a Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2010-10-09 10:18:25 R-tree Rope Tree decomposition Tree traversal Tree T-tree Graph theory Binary trees Lowest common ancestor
100	Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inabaa , Haruo Hosoyab a National Institute of Informatics, 2-1-1, Hitotsubashi, Chiyoda-ku, Tokyo, Japan University of Tokyo, 7-3-1 Hongo, Bunkyo- Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2010-06-08 09:56:29 Lowest common ancestor Theoretical computer science Tree traversal Rope Eval Graph theory Computing Binary trees

UPDATE